Neighbourhood Structures: Bisimilarity and Basic Model Theory
نویسندگان
چکیده
منابع مشابه
Neighbourhood Structures: Bisimilarity and Basic Model Theory
Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 2. We use this coalgebraic modelling to derive notions of equivalence between neighbourhood s...
متن کاملNeighbourhood Structures: Bisimilarity and Basic Model Theory
Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 2 2. We use this coalgebraic modelling to derive notions of equivalence between neighbourhood...
متن کاملBasic Conceptual Structures Theory
Although the theory of Conceptual Structures is over 10 years old, basic notions (like canonical graphs) are far from settled and are subject to constant extensions and refor-mulations. However, most of these are done in an informal way, which doesn't help in clarifying the issues involved. It is our hope that this paper will provide a rst step towards the complete and rigorous account of Conce...
متن کاملBasic Conceptual Structures Theory ∗ Michel
Although the theory of Conceptual Structures is over 10 years old, basic notions (like canonical graphs) are far from settled and are subject to constant extensions and reformulations. However, most of these are done in an informal way, which doesn’t help in clarifying the issues involved. It is our hope that this paper will provide a first step towards the complete and rigorous account of Conc...
متن کاملApproximating Weak Bisimilarity of Basic Parallel Processes
This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We also show their limitations for the general case. In particular, we show a lower bound of ω ∗ω for the approximants which allow weak steps and a lower bound o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2009
ISSN: 1860-5974
DOI: 10.2168/lmcs-5(2:2)2009